Nondeterminisic Sublinear Time Has Measure 0 in P
نویسندگان
چکیده
The measure hypothesis is a quantitative strengthening of the P != NP conjecture which asserts that NP is a nonnegligible subset of EXP. Cai, Sivakumar, and Strauss (1997) showed that the analogue of this hypothesis in P is false. In particular, they showed that NTIME[n^{1/11}] has measure 0 in P. We improve on their result to show that the class of all languages decidable in nondeterministic sublinear time has measure 0 in P. Our result is based on DNF width and holds for all four major notions of measure on P.
منابع مشابه
Belohorec-type Oscillation Theorem for Second Order Sublinear Dynamic Equations on Time Scales
Consider the Emden-Fowler sublinear dynamic equation (0.1) x(t) + p(t)x(σ(t)) = 0, where p ∈ C(T, R), where T is a time scale, 0 < α < 1, α is the quotient of odd positive integers. When p(t) is allowed to take on negative values, we obtain a Belohorec-type oscillation theorem for (0.1). As an application, we get that the sublinear difference equation (0.2) ∆x(n) + p(n)x(n+ 1) = 0, is oscillato...
متن کاملOptimal Stopping under Adverse Nonlinear Expectation and Related Games
We study the existence of optimal actions in a zero-sum game infτ supP E P [Xτ ] between a stopper and a controller choosing a probability measure. This includes the optimal stopping problem infτ E(Xτ ) for a class of sublinear expectations E(·) such as the G-expectation. We show that the game has a value. Moreover, exploiting the theory of sublinear expectations, we define a nonlinear Snell en...
متن کاملOscillation of Second-Order Sublinear Dynamic Equations with Damping on Isolated Time Scales
This paper concerns the oscillation of solutions to the second sublinear dynamic equation with damping xΔΔ t q t xΔ σ t p t x σ t 0, on an isolated time scale which is unbounded above. In 0 < α < 1, α is the quotient of odd positive integers. As an application, we get the difference equation Δ2x n n−γΔx n 1 1/n lnn β b −1 / lnn β x n 1 0, where γ > 0, β > 0, and b is any real number, is oscilla...
متن کاملSublinear Time Orthogonal Tensor Decomposition
A recent work (Wang et. al., NIPS 2015) gives the fastest known algorithms for orthogonal tensor decomposition with provable guarantees. Their algorithm is based on computing sketches of the input tensor, which requires reading the entire input. We show in a number of cases one can achieve the same theoretical guarantees in sublinear time, i.e., even without reading most of the input tensor. In...
متن کاملPartial Subliner Time Approximation and Inapproximation for Maximum Coverage
We develop a randomized approximation algorithm for the classical maximum coverage problem, which given a list of sets A1, A2, · · · , An and integer parameter k, select k sets Ai 1 , Ai 2 , · · · , Ai k for maximum union Ai 1 ∪ Ai 2 ∪ · · · ∪ Ai k. In our algorithm, each input set Ai is a black box that can provide its size |Ai|, generate a random element of Ai, and answer the membership query...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 25 شماره
صفحات -
تاریخ انتشار 2018